Parallel Detection of all Palindromes in a String
نویسندگان
چکیده
Zvi Calil' Columbia University and Tel-Aviv University This paper prespnts two ",flit-iE-lit concnrrf:'nt-read cone-uTfPnt-writE' parallel algorithms that find all palindromE's in a givPlI string: J. An ()(Io~ n) timf', n-[ITOCE'Ssor alp;orithm over general alphahets. In case of can· stant size alphahpts til(> <llgol'ithm fPquirps only lI.Jlogn processors, and thus achievps <til oplimal.spepdnp. 2. An O(log log 1/.) time. nlog n/lo,e; log n-procpssor algorithm over general alphab('ts. This is the fastest possihle timE' with the number of processors used. ThE'sE' Hew results improvp all the known parallel palindrome detection alj:!;orithms by using smaller auxiliary space and either by makingfewer operations or by achieving a faster runningtime.
منابع مشابه
Finding All Periods and Initial Palindromes of a String in Parallel 1
An optimal O(log log n) time CRCW-PRAM algorithm for computing all period lengths of a string is presented. Previous parallel algorithms compute the period only if it is shorter than half of the length of the string. The algorithm can be used to nd all initial palindromes of a string in the same time and processor bounds. Both algorithms are the fastest possible over a general alphabet. We deri...
متن کاملOptimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract)
of results Optimal concurrent-read concurrent-write parallel algorithms for two problems are presented: Finding all the periods of a string. The period of a string can be computed by previous eecient parallel algorithms only if it is shorter than half of the length of the string. Our new algorithm computes all the periods in optimal O(loglog n) time, even if they are longer. The algorithm can b...
متن کاملLooking for All Palindromes in a String
A palindrome is a string of the form αα', where α and α' are also strings and reverse to each other. The problem of the paper is defined as follows: given a string S of length n, find all palindromes occurring in the given string S. In the paper, we present an algorithm based on suffix trees to find palindromes. Our algorithm will find all maximum palindromes which are not contained in any othe...
متن کاملRepeats and Palindromes: an Overview
With a long text string like DNA, repeats and palindromes are not easily spotted. Yet nding such substrings is important; for instance, repeats in DNA are indicators of certain hereditary disorders and are used as genetic markers. We discuss repeats and then palindromes and then we relate the two. In our discussion of repeats, we rst de ne an exact repeat and then ve de nitions of approximate r...
متن کاملCounting and Verifying Maximal Palindromes
A palindrome is a symmetric string that reads the same forward and backward. Let Pals(w) denote the set of maximal palindromes of a string w in which each palindrome is represented by a pair (c, r), where c is the center and r is the radius of the palindrome. We say that two strings w and z are pal-distinct if Pals(w) 6= Pals(z). Firstly, we describe the number of pal-distinct strings, and show...
متن کامل